Non-local Robustness Analysis via Rewriting Techniques

Non-local robustness analysis via rewriting techniques

Robustness is a correctness property which intuitively means that if the inputs to a program changes less than a fixed small amount then its output changes only slightly. The study of errors caused by finite-precision semantics requires a stronger property: the results in the finite-precision semantics have to be close to the result in the exact semantics. Compositional methods often are not us...

Specification, analysis and transformation of security policies via rewriting techniques

Formal methods for the specification and analysis of security policies have drawn many attention recently. It is now well known that security policies can be represented using rewriting systems. These systems constitute an interesting formalism to prove properties while provides an operational way to evaluate authorization requests. In this paper, we propose to split the expression of security ...

Non-computational Equations and Rewriting Techniques

Datalog Rewriting Techniques for Non-Horn Ontologies

We study the closely related problems of rewriting disjunctive datalog programs and non-Horn DL ontologies into plain datalog programs that entail the same facts for every dataset. We first propose the class of markable disjunctive datalog programs, which is efficiently recognisable and admits polynomial rewritings into datalog. Markability naturally extends to SHI ontologies, and markable onto...

Analysis of performance and robustness of biological switches: local tools for non-local dynamical phenomena

Biological switches are frequently encountered in mathematical modeling of biological systems because binary decisions are at the core of many cellular processes. A bistable switch presents two stable steady-states, each of them corresponding to a distinct decision. These two decisions are assumed to result from the interactions between biochemical effectors at the molecular level. Because thes...